The firefighter problem for graphs of maximum degree three
نویسندگان
چکیده
منابع مشابه
The firefighter problem for graphs of maximum degree three
We consider a dynamic problem introduced by B. Hartnell in 1995 [4]. Let (G, r) be a connected rooted graph (where r ∈ V (G)). At time 0, a fire breaks out at r. At each subsequent time interval, the firefighter defends some vertex which is not on fire, and then the fire spreads to all undefended neighbours of each burning (i.e., on fire) vertex. Once defended, a vertex remains so for all time ...
متن کاملThe firefighter problem for cubic graphs
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from the root, it is NPcomplete to decide whether or not there is a strategy that protects every leaf from the fire, which starts at the root. By contrast, we describe a polynomial time algorithm to decide if it is possible ...
متن کاملc-Critical Graphs with Maximum Degree Three
Let G be a (simple) graph with maximum degree three and chromatic index four. A 3-edge-coloring of G is a coloring of its edges in which only three colors are used. Then a vertex is conflicting when some edges incident to it have the same color. The minimum possible number of conflicting vertices that a 3edge-coloring of G can have, d(G), is called the edge-coloring degree of G. Here we are mai...
متن کاملLabeling outerplanar graphs with maximum degree three
An L(2, 1)-labeling of a graph G is an assignment of a nonnegative integer to each vertex of G such that adjacent vertices receive integers that differ by at least two and vertices at distance two receive distinct integers. The span of such a labeling is the difference between the largest and smallest integers used. The λ-number of G, denoted by λ(G), is the minimum span over all L(2, 1)-labeli...
متن کاملThe independence number in graphs of maximum degree three
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n−m− λ− tr) where λ counts the number of components of G whose blocks are each either isomorphic to one of four specific graphs or edges between two of these four specific graphs and tr is the maximum number of vertex-disjoint triangles in G. Our result genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.12.053